Research Program
Application Domains
New Software and Platforms
New Results
- Birkhoff–von Neumann decomposition
- Parallel sparse matrix-vector multiply
- Scheduling series-parallel task graphs to minimize peak memory
- Parallel Candecomp/Parafac decomposition of sparse tensors using dimension trees
- Approximation algorithms for maximum matchings in undirected graphs
- SINA: A Scalable iterative network aligner
- Acyclic partitioning of large directed acyclic graphs
- Effective heuristics for matchings in hypergraphs
- Scaling matrices and counting the perfect matchings in graphs
- A scalable clustering-based task scheduler for homogeneous processors using DAG partitioning
- Data-Locality Aware Dynamic Schedulers for Independent Tasks with Replicated Inputs
- Parallel scheduling of DAGs under memory constraints.
- Online Scheduling of Task Graphs on Hybrid Platforms.
- Memory-aware tree partitioning on homogeneous platforms
- Reliability-aware energy optimization for throughput-constrained applications on MPSoC.
- Malleable task-graph scheduling with a practical speed-up model
- Performance and scalability of the block low-rank multifrontal factorization on multicore architectures
- On exploiting sparsity of multiple right-hand sides in sparse direct solvers
- Efficient use of sparsity by direct solvers applied to 3D controlled-source EM problems
- A Generic Approach to Scheduling and Checkpointing Workflows
- Scheduling independent stochastic tasks under deadline and budget constraints
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
Bibliography
Research Program
Application Domains
New Software and Platforms
New Results
- Birkhoff–von Neumann decomposition
- Parallel sparse matrix-vector multiply
- Scheduling series-parallel task graphs to minimize peak memory
- Parallel Candecomp/Parafac decomposition of sparse tensors using dimension trees
- Approximation algorithms for maximum matchings in undirected graphs
- SINA: A Scalable iterative network aligner
- Acyclic partitioning of large directed acyclic graphs
- Effective heuristics for matchings in hypergraphs
- Scaling matrices and counting the perfect matchings in graphs
- A scalable clustering-based task scheduler for homogeneous processors using DAG partitioning
- Data-Locality Aware Dynamic Schedulers for Independent Tasks with Replicated Inputs
- Parallel scheduling of DAGs under memory constraints.
- Online Scheduling of Task Graphs on Hybrid Platforms.
- Memory-aware tree partitioning on homogeneous platforms
- Reliability-aware energy optimization for throughput-constrained applications on MPSoC.
- Malleable task-graph scheduling with a practical speed-up model
- Performance and scalability of the block low-rank multifrontal factorization on multicore architectures
- On exploiting sparsity of multiple right-hand sides in sparse direct solvers
- Efficient use of sparsity by direct solvers applied to 3D controlled-source EM problems
- A Generic Approach to Scheduling and Checkpointing Workflows
- Scheduling independent stochastic tasks under deadline and budget constraints
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
Bibliography
Previous | 
Home